On the Computation of Warranted Arguments within a Possibilistic Logic Framework with Fuzzy Unification

Possibilistic Defeasible Logic Programming (\Pdelp) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at object-language level. The aim of this paper is twofold: first to present an approach towards extending \Pdelp in order to incorporate fuzzy constants and fuzzy unification, and after to propose a way to handle conflicting arguments in the context of the extended framework. Source URL: https://www.iiia.csic.es/en/node/55461 Links [1] https://www.iiia.csic.es/en/staff/teresa-alsinet [2] https://www.iiia.csic.es/en/staff/c-ches%C3%B1evar [3] https://www.iiia.csic.es/en/staff/llu%C3%ADs-godo [4] https://www.iiia.csic.es/en/staff/sandra-sandri [5] https://www.iiia.csic.es/en/staff/g-simari [6] https://www.iiia.csic.es/en/bibliography?f[author]=1187 [7] https://www.iiia.csic.es/en/bibliography?f[author]=1188